Best one-sided L1 approximation to the Heaviside and sign functions

نویسندگان

  • Jorge Bustamante
  • José M. Quesada
  • Reinaldo Martínez-Cruz
چکیده

We find the polynomials of the best one-sided approximation to the Heaviside and sign functions. The polynomials are obtained by Hermite interpolation at the zeros of some Jacobi polynomials. Also we give an estimate of the error of approximation and characterize the extremal points of the convex set of the best approximants. c ⃝ 2012 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best L1 Approximation and Locally Computed L1 Spline Fits of the Heaviside Function and Multiscale Univariate Datasets

Best L1 approximations of the Heaviside function in Chebyshev and weak-Chebyshev spaces has a Gibbs phenomenon. It has been shown in the nineties for the trigonometric polynomial [1] and polygonal line cases [2]. By mean of recent results of characterization of best L1 approximation in Chebyshev and weak-Chebyshev spaces [3] that we recall, this Gibbs phenomenon can also be evidenced in the pol...

متن کامل

L1-approximation to Laplace transforms of signed measures

For functions that are piecewise equal to one-sided Laplace transforms of signed measures we construct interpolations that are entire functions with interpolation points that are zeros of Laguerre-Pólya entire functions. If the interpolated function f is sufficiently regular, these interpolations are best approximations in L-norm to f by functions of fixed exponential type. This is demonstrated...

متن کامل

Best approximation by Heaviside perceptron networks

In Lp-spaces with p an integer from [1, infinity) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p an integer from (1, infinity) such best approximation is not unique and cannot be continuous.

متن کامل

Best one-sided approximation of polynomials under L1 norm

In this paper, we develop an analytic solution for the best one-sided approximation of polynomials under L1 norm, that is, we 0nd two polynomials with lower degree which bound the given polynomial such that the areas between the bounding polynomials and the given polynomial attain minimum. The key ingredient of our technique is a characterization for one-sided approximations based on orthogonal...

متن کامل

Some Notes on the Best One-sided Approximation of Polynomials under L1 Norm

In the paper we review some known results about the one-sided approximation of polynomials with lower-degree polynomials under L1 norm. Then based on these results, the approximation error is formulated. Some properties are also stated for the general cases. The approximation can be used in the degree reduction of interval polynomials and interval Bézier curves.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Approximation Theory

دوره 164  شماره 

صفحات  -

تاریخ انتشار 2012